Hurwitz Equivalence in Tuples of Dihedral Groups, Dicyclic Groups, and Semidihedral Groups
نویسندگان
چکیده
منابع مشابه
Hurwitz Equivalence in Tuples of Dihedral Groups, Dicyclic Groups, and Semidihedral Groups
Let D2N be the dihedral group of order 2N , Dic4M the dicyclic group of order 4M , SD2m the semidihedral group of order 2 m, and M2m the group of order 2 m with presentation M2m = 〈α, β | α 2m−1 = β2 = 1, βαβ−1 = α2 m−2+1〉. We classify the orbits in Dn 2N , Dic n 4M , SD n 2m , and M n 2m under the Hurwitz action.
متن کاملHurwitz Equivalence in Dihedral Groups
In this paper we determine the orbits of the braid group Bn action on Gn when G is a dihedral group and for any T ∈ Gn. We prove that the following invariants serve as necessary and sufficient conditions for Hurwitz equivalence. They are: the product of its entries, the subgroup generated by its entries, and the number of times each conjugacy class (in the subgroup generated by its entries) is ...
متن کاملHurwitz Equivalence in Tuples of Generalized Quaternion Groups and Dihedral Groups
Let Q2m be the generalized quaternion group of order 2 m and DN the dihedral group of order 2N . We classify the orbits in Q2m and D n pm (p prime) under the Hurwitz action. 1 The Hurwitz Action Let G be a group. For a, b ∈ G, let a = bab and a = bab. The Hurwitz action on G (n ≥ 2) is an action of the n-string braid group Bn on G . Recall that Bn is given by the presentation Bn = 〈σ1, . . . , ...
متن کاملCalculations of Dihedral Groups Using Circular Indexation
In this work, a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$. Each element of the sequence represents a vertex of the polygon. Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis. Here each symmetry is considered as a system that takes an input circular sequence and g...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2009
ISSN: 1077-8926
DOI: 10.37236/184